Contrasting stochasticity with chaos in a permutation Lempel–Ziv complexity — Shannon entropy plane
نویسندگان
چکیده
منابع مشابه
On the analysis of signals in a permutation Lempel-Ziv complexity - permutation Shannon entropy plane
The aim of this paper is to introduce the Lempel–Ziv permutation complexity vs permutation entropy plane as a tool to analyze time series of different nature. This two quantities make use of the Bandt and Pompe representation to quantify continuous-state time series. The strength of this plane is to combine two different perspectives to analyze a signal, one being statistic (the permutation ent...
متن کاملShannon Entropy vs. Kolmogorov Complexity
Most assertions involving Shannon entropy have their Kolmogorov complexity counterparts. A general theorem of Romashchenko [4] states that every information inequality that is valid in Shannon’s theory is also valid in Kolmogorov’s theory, and vice verse. In this paper we prove that this is no longer true for ∀∃-assertions, exhibiting the first example where the formal analogy between Shannon e...
متن کاملInequalities for Shannon Entropy and Kolmogorov Complexity
It was mentioned by Kolmogorov (1968, IEEE Trans. Inform. Theory 14, 662 664) that the properties of algorithmic complexity and Shannon entropy are similar. We investigate one aspect of this similarity. Namely, we are interested in linear inequalities that are valid for Shannon entropy and for Kolmogorov complexity. It turns out that (1) all linear inequalities that are valid for Kolmogorov com...
متن کاملPermutation entropy: a natural complexity measure for time series.
We introduce complexity parameters for time series based on comparison of neighboring values. The definition directly applies to arbitrary real-world data. For some well-known chaotic dynamical systems it is shown that our complexity behaves similar to Lyapunov exponents, and is particularly useful in the presence of dynamical or observational noise. The advantages of our method are its simplic...
متن کاملSome equivalences between Shannon entropy and Kolmogorov complexity
[24] A. N. Kolmogorov, “On the approximation of distributions of 1271 G. H. Hardy, J. E. Litt lewood, and G. Polya, ZnequaIit ies. New sums of independent summa nds by infinitely divisible distributions,” San/&v& vol. 25, pp. 159-174, 1963. [28] York and London: Cambridge Univ. Press? 1934. D. E. Da kin and C. J. Eliezer, “General ization of Holder’s and (251 A. Renyi, “On the amount of missing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 2020
ISSN: 0378-4371
DOI: 10.1016/j.physa.2020.124640